منابع مشابه
Identifying the best performing hardware platform based on inherent program similarity
An important problem in benchmarking is to identify the platform that yields the best performance for an application of interest. This paper proposes a methodology for doing this, using both microarchitecture-independent characteristics and genetic algorithms. We first compare the application of interest with the programs from a profiled benchmark suite. We subsequently make a performance predi...
متن کاملInherent Limitations of Visual Search and the Role of Inner-Scene Similarity
This work focuses on inner-scene objects similarity as an information source for directing attention and for speedingup visual search. A scalar measure (similar to Kolmogorov’s 2-covering of metric spaces) is suggested for quantifying how much a visual search task can benefit from this source of information. The measure provided is algorithm independent, providing an inherent measure for tasks’...
متن کاملDynamic Visual Search Using Inner-Scene Similarity: Algorithms and Inherent Limitations
A dynamic visual search framework based mainly on innerscene similarity is proposed. Algorithms as well as measures quantifying the difficulty of search tasks are suggested. Given a number of candidates (e.g. sub-images), our basic hypothesis is that more visually similar candidates are more likely to have the same identity. Both deterministic and stochastic approaches, relying on this hypothes...
متن کاملA Triangle-Triangle Intersection Algorithm
The intersection between 3D objects plays a prominent role in spatial reasoning, geometric modeling and computer vision. Detection of possible intersection between objects can be based on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross intersection and coplanar intersection. There is no single algor...
متن کاملFaster Triangle-Triangle Intersection Tests
This paper presents a new method for computing whether or not two triangles in three dimensions intersect. The code is very efficient and requires minimum arithmetic precision. Indeed, all branching decisions are carried out by evaluating the signs of degree three polynomials. In addition, an efficient test is proposed for the two-dimensional case. Key-words: geometric predicates, low degree pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics Research
سال: 2012
ISSN: 1916-9809,1916-9795
DOI: 10.5539/jmr.v4n1p35